The algebraic degree of geometric optimization problems
نویسندگان
چکیده
منابع مشابه
The Algebraic Degree of Geometric Optimization Problems
AJ1STRACT In this paper we apply Galois theoretic algebraic methods to certain fundamental geometric optimization problems whose recognition versions are not even known to be in the class NP. In particular we show that the classic Weber problem, the Line-restricted' Weber probe lem and the 3-Dimension version of this problem are in general not solvable by radicals over the field of rationals. O...
متن کاملAlgebraic Degree of Polynomial Optimization
Consider the polynomial optimization problem whose objective and constraints are all described by multivariate polynomials. Under some genericity assumptions, we prove that the optimality conditions always hold on optimizers, and the coordinates of optimizers are algebraic functions of the coefficients of the input polynomials. We also give a general formula for the algebraic degree of the opti...
متن کاملGlobal optimization of fractional posynomial geometric programming problems under fuzziness
In this paper we consider a global optimization approach for solving fuzzy fractional posynomial geometric programming problems. The problem of concern involves positive trapezoidal fuzzy numbers in the objective function. For obtaining an optimal solution, Dinkelbach’s algorithm which achieves the optimal solution of the optimization problem by means of solving a sequence of subproblems ...
متن کاملSolving Geometric Optimization Problems
We show how to use graphics hardware for tackling optimization problems arising in the field of computational geometry. We exemplarily discuss three problems, where combinatorial algorithms are inefficient or hard to implement. Given a set S of n point in the plane, the first two problems are to determine the smallest homothetic scaling of a star shaped polygon P enclosing S and to find the lar...
متن کاملTwo Geometric Optimization Problems
We consider two optimization problems with geometric structures The rst one con cerns the following minimization problem termed as the rectilinear polygon cover problem Cover certain features of a given rectilinear polygon possibly with rectilinear holes with the minimum number of rectangles included in the polygon Depending upon whether one wants to cover the interior boundary or corners of th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete & Computational Geometry
سال: 1988
ISSN: 0179-5376,1432-0444
DOI: 10.1007/bf02187906